Permutation-induced acyclic networks for the job shop scheduling problem
نویسندگان
چکیده
منابع مشابه
Permutation-induced acyclic networks for the job shop scheduling problem
In the literature of the combinatorial optimization problems, it is a commonplace to find more than one mathematical model for the same problem. The significance of a model may be measured in terms of the efficiency of the solution algorithms that can be built upon it. The purpose of this article is to present a new network model for the well known combinatorial optimization problem – the job s...
متن کاملScheduling in Job Shops Using Permutation Induced Acyclic Networks
The job shop scheduling problem (JSP) arises in lowvolume production systems in which products are made to order. In such production systems, jobs usually differ considerably in their processing sequences and times. Solving the JSP is particularly important for the efficient utilization of production resources and for satisfying due dates. However, the JSP is fairly complex and known to be NP-h...
متن کاملImproved Bounds for Acyclic Job Shop Scheduling
In acyclic job shop scheduling problems there are jobs and machines. Each job is composed of a sequence of operations to be performed on different machines. A legal schedule is one in which within each job, operations are carried out in order, and each machine performs at most one operation in any unit of time. If denotes the length of the longest job, and denotes the number of time units reque...
متن کاملThe Job-shop Scheduling Problem the Job-shop Scheduling Problem with Setup Times
This paper reports a bibliographical study and some personnal works about the general Jobshop Problem and Jobshop Problems with setup times. Section 1 introduces some { usual { notations about the general problem. Speciic notations concerning with setup times will be introduced later. The bibliograacal study, in Section 2 focuses on recent papers on both problems. Section 3 presents a general s...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2009
ISSN: 0307-904X
DOI: 10.1016/j.apm.2008.02.004